First-order sequential convex programming using approximate diagonal QP subproblems
نویسندگان
چکیده
منابع مشابه
Approximate Linear Programming for First-order MDPs
We introduce a new approximate solution technique for first-order Markov decision processes (FOMDPs). Representing the value function linearly w.r.t. a set of first-order basis functions, we compute suitable weights by casting the corresponding optimization as a first-order linear program and show how off-the-shelf theorem prover and LP software can be effectively used. This technique allows on...
متن کاملApproximate Linear Programming for Network Control: Column Generation and Subproblems
Approximate linear programming (ALP) has been shown to provide useful bounds on optimal average cost for multiclass queueing network control problems. Approximation architectures can be chosen so that a manageable number of variables gives moderate accuracy; however, the number of constraints grows exponentially in the number of queues. We use column generation to more efficiently solve the dua...
متن کاملIteration-complexity of first-order penalty methods for convex programming
This paper considers a special but broad class of convex programming (CP) problems whose feasible region is a simple compact convex set intersected with the inverse image of a closed convex cone under an affine transformation. It studies the computational complexity of quadratic penalty based methods for solving the above class of problems. An iteration of these methods, which is simply an iter...
متن کاملSequential and Parallel Approximate Convex Hull Algorithms
This paper defines the area measure of the quality of approximate convex hulls and proposes two new approximate convex hull algorithms. The first one is superior to known techniques under the area measure and comparable under the distance measure and time complexity. The second algorithm is superior to all known algorithms in both area and distance measures (including the first algorithm) while...
متن کاملProbabilistic Guidance of Swarms using Sequential Convex Programming∗
In this paper, we integrate, implement, and validate formation flying algorithms for large number of agents using probabilistic swarm guidance with inhomogeneous Markov chains and model predictive control with sequential convex programming. Using an inhomogeneous Markov chain, each agent determines its target position during each time step in a statistically independent manner while the swarm c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural and Multidisciplinary Optimization
سال: 2011
ISSN: 1615-147X,1615-1488
DOI: 10.1007/s00158-011-0739-3